package Lee_code;

/**
 * @author blh
 * @date 2024年07月03日 8:45
 */
public class Lee_153_73 {
    public int findMin(int[] nums) {
        int len = nums.length;
        int left = 0;
        int right = len - 1;
        while (left < right) {
            int mid = left + (right - left) / 2;

            if (nums[right] < nums[mid]) {
                left = mid + 1;
            } else {
                right = right-1;
            }
        }
        return left;
    }
}
